Perfect Information Leader Election in log*n+O(1) Rounds
نویسندگان
چکیده
منابع مشابه
Perfect Information Leader Election in log*n + O(1) Rounds
In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Protocols proceed in rounds: though players are synchronized between rounds, within each round the...
متن کاملRobust Stabilizing Leader Election
In this paper, we mix two well-known approaches of the fault-tolerance: robustness and stabilization. Robustnessis the aptitude of an algorithm to withstand permanent failures such as process crashes. The stabilization is a generaltechnique to design algorithms tolerating transient failures. Using these two approaches, we propose algorithms thattolerate both transient and crash fail...
متن کاملOn Leader Green Election
In Jacquet et al. (2013) Philippe Jacquet, Dimitris Milioris and Paul Mühlethaler introduced a novel energy efficient broadcast leader election algorithm, which they called, in accordance with the popular fashion in those years, a Leader Green Election (LGE). This algorithm was also presented by P. Jacquet at the conference AofA’13. We will use the same model as in Jacquet et al. (2013), namely...
متن کاملStable Leader Election
We introduce the notion of stable leader election and derive several algorithms for this problem. Roughly speaking, a leader election algorithm is stable if it ensures that once a leader is elected, it remains the leader for as long as it does not crash and its links have been behaving well, irrespective of the behavior of other processes and links. In addition to being stable, our leader elect...
متن کاملLeader election in synchronous networks
Worst, best and average number of messages and running time of leader election algorithms of different distributed systems are analyzed. Among others the known characterizations of the expected number of messages for LCR algorithm and of the worst number of messages of Hirschberg-Sinclair algorithm are improved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2001
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1776